Diophantine Approximation by Primes

نویسنده

  • KAISA MATOMÄKI
چکیده

We show that whenever δ > 0 and constants λi satisfy some necessary conditions, there are infinitely many prime triples p1, p2, p3 satisfying the inequality |λ0 + λ1p1 + λ2p2 + λ3p3| < (max pj)−2/9+δ. The proof uses Davenport–Heilbronn adaption of the circle method together with a vector sieve method. 2000 Mathematics Subject Classification. 11D75, 11N36, 11P32.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diophantine Approximation with Arithmetic Functions, I

We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.

متن کامل

Diophantine approximation with primes and powers of two

We investigate the values taken by real linear combinations of two primes and a bounded number of powers of two. Under certain conditions, we are able to demonstrate that these values can be made arbitrarily close to any real number by taking sufficiently many powers of two.

متن کامل

On the counting function of irregular primes

It is well-known that there are infinitely many irregular primes. We prove a quantitative version of this statement, namely the number of such primes p ≤ x is at least (1 + o(1)) log log x/ log log log x as x → ∞. We show that the same conclusion holds for the irregular primes corresponding to the Euler numbers. Under some conditional results from diophantine approximation, the above lower boun...

متن کامل

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations

Let N be an integer with at least two distinct prime factors. We reduce the problem of factoring N to the task of nding t + 2 integer solutions (e1; : : : ; et) 2 ZZ t of the inequalities t X i=1 ei log pi ? log N N ?c p o(1) t t X i=1 jei log pij (2c ? 1) log N + 2 log pt; where c > 1 is xed and p1; : : : ; pt are the rst t primes. We show, under a reasonable hypothesis, that there are N "+o(1...

متن کامل

Diophantine Approximation by Cubes of Primes and an Almost Prime II

Let λ1, . . . , λ4 be non-zero with λ1/λ2 irrational and negative, and let S be the set of values attained by the form λ1x 3 1 + · · · + λ4x4 when x1 has at most 3 prime divisors and the remaining variables are prime. We prove that most real numbers are close to an element of S.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009